Canonical Disjoint NP-Pairs of Propositional Proof Systems

نویسندگان

  • Christian Glaßer
  • Alan L. Selman
  • Liyu Zhang
چکیده

We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure of the class of disjoint NP-pairs and of all canonical pairs is identical. Secondly, we show that this degree structure is not superficial: Assuming there exist P-inseparable disjoint pairs, there exist intermediate disjoint NP-pairs. That is, if (A,B) is a P-separable disjoint NP-pair and (C,D) is a P-inseparable disjoint NP-pair, then there exist P-inseparable, incomparable NP-pairs (E,F ) and (G,H) whose degrees lie strictly between (A,B) and (C,D). Furthermore, between any two disjoint NP-pairs that are comparable and inequivalent, such a diamond exists.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classes of Representable Disjoint NP - Pairs 1

For a propositional proof system P we introduce the complexity class DNPP(P ) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P . We exhibit structural properties of proof systems which make canonical NP-pairs associated with these proof systems hard or complete for DNPP(P ). Moreover, we demonstrate that non-equivalent proof systems c...

متن کامل

Classes of representable disjoint NP-pairs

For a propositional proof system P we introduce the complexity class DNPP(P) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P . We exhibit structural properties of proof systems which make canonical NP-pairs associated with these proof systems hard or complete for DNPP(P). Moreover, we demonstrate that nonequivalent proof systems can ...

متن کامل

The Informational Content of Canonical Disjoint NP-Pairs

We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between their canonical pairs. We focus on the opposite direction and study the following questions. Q1: Where does the implication [can(f) ≤ m can(g) ⇒ f ≤s g] hold, and where does it fail? Q2: Where can we find proof systems of...

متن کامل

Disjoint NP-Pairs from Propositional Proof Systems

For a proof system P we introduce the complexity class DNPP(P ) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P . We exhibit structural properties of proof systems which make the previously defined canonical NP-pairs of these proof systems hard or complete for DNPP(P ). Moreover we demonstrate that non-equivalent proof systems can ha...

متن کامل

Tuples of Disjoint NP-Sets

Disjoint NP-pairs are a well studied complexity-theoretic concept with important applications in cryptography and propositional proof complexity. In this paper we introduce a natural generalization of the notion of disjoint NP-pairs to disjoint k-tuples of NP-sets for k ≥ 2. We define subclasses of the class of all disjoint k-tuples of NP-sets. These subclasses are associated with a proposition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 370  شماره 

صفحات  -

تاریخ انتشار 2004